The Cayley graphs of Coxeter and Artin groups
نویسندگان
چکیده
منابع مشابه
The Cayley Graphs of Coxeter and Artin Groups
We obtain a complete classification of the Coxeter and Artin groups whose Cayley graphs with respect to the standard presentations are planar. We also classify those whose Cayley graphs have planar embeddings in which the vertices have no accumulation points.
متن کاملArtin Groups and Coxeter Groups
where the words on each side of these relations are sequences of mij letters where ai and aj alternate in the sequence. The matrix of values mij is a Coxeter matrix M = (mij)i,j∈I on I. These groups generalize the braid groups established in 1925 by E. Artin in a natural way and therefore we suggest naming them Artin groups. If one adds the relations ai = 1 to the relations in the presentation ...
متن کاملRigidity of Coxeter Groups and Artin Groups
A Coxeter group is rigid if it cannot be defined by two nonisomorphic diagrams. There have been a number of recent results showing that various classes of Coxeter groups are rigid, and a particularly interesting example of a nonrigid Coxeter group has been given in [17]. We show that this example belongs to a general operation of “diagram twisting”. We show that the Coxeter groups defined by tw...
متن کاملThe Distance Spectra of Cayley Graphs of Coxeter Groups
The absolute (respectively, weak) order graph on a Coxeter group is the graph underlying the absolute (respectively, weak) order poset. We investigate the distance spectra of many of these graphs and pose several open problems. ∗The author gratefully acknowledges the support of David Wales, Rick Wilson, and the mathematics department of the California Institute of Technology. He would also like...
متن کاملTwo identification protocols based on Cayley graphs of Coxeter groups
A challenge-response identification protocol is introduced, based on the intractability of the word problem in some Coxeter groups. A Prover builds his public key as the set of leaves of a tree in the Cayley graph of a Coxeter group, and the tree itself is his private keys. Any challenge posed by a Verifier consists of a subset of the public key, and the Prover shows his knowledge of the privat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1993
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1993-1140668-4